Maintaining Maintainability = Recognizing Reachability
نویسندگان
چکیده
One of the main cost of maintenance is continual retesting. Testing will be characterized as the construction of pathways that reach from inputs to some interesting zone of a program. This zone could be a bug or a desired feature. In this reachability view, the goal of testing is to show that a test set uncovers no bugs while reaching all desired features. A system is hard to maintain if it is hard to test; i.e. if the reachability odds are low. In this view, easy maintenance is impossible without easy testing and easy testing is impossible without easy reachability.
منابع مشابه
Improved Fully Dynamic Reachability Algorithm for Directed Graph
We propose a fully dynamic algorithm for maintaining reachability information in directed graphs. The proposed deterministic dynamic algorithm has an update time of O((ins ∗ n) + (del ∗ (m + n ∗ log(n)))) where m is the current number of edges, n is the number of vertices in the graph, ins is the number of edge insertions and del is the number of edge deletions. Each query can be answered in O(...
متن کاملCritical Insight into Maintainability and Reliability Assessment Aspects of Software Systems Using Soft Computing Approaches
Maintaining software has always been a difficult task. In most cases,maintaining software takes greater time and effort than its development time. Also, predicting the software maintainability makes the process more complex. Reliability in terms of application software is characterized as the functioning of software i.e. carrying out its operations without any failure is the most important requ...
متن کاملAn Alternative Construction in Symbolic Reachability Analysis of Second Order Pushdown Systems
Recently, it has been shown that for any higher order pushdown system H and for any regular set C of configurations, the set pre ∗ H(C), is regular. In this paper, we give an alternative proof of this result for second order automata. Our construction of automata for recognizing pre∗H(C) is explicit. The termination of saturation procedure used is obvious. It gives a better bound on size of the...
متن کاملIndividual management of personal reachability in mobile communication
This paper describes a concept for controlling personal reachability while maintaining a high degree of privacy and data protection. By easy negotiation of their communication requests users can reach others without disturbing the called partners and without compromising their own privacy. Reachability management can strengthen the called subscriber's right to self-determined communication with...
متن کاملA Quantitative Evaluation of Maintainability of Software Architecture Styles
Proper decisions play a crucial role in any software architecture design process. An important decision of design stage is the selection of a suitable software architecture style. Lack of investigation on the quantitative impact of architecture styles on software quality attributes is the main problem in using such styles. Consequently, the use of architecture styles in designing is based on th...
متن کامل